Notes on Two Methods for Direct Construction of Probabilistic Lfsr Sequences of Third Order Lhoussain El Fadil and Danilo Gligoroski

نویسنده

  • DANILO GLIGOROSKI
چکیده

In [4], the authors give two public key encryptions based on third order linear sequences modulo n, where n = pq is an RSA integer. In their scheme (3), there are two mistakes in the decryption procedure: (1) The owner of the private key does not know the value of m such that C1 = sm(a, b) and C2 = s−m(a, b), and thus he/she can not compute L(C1, C2). (2) If sλ(a, b) = 3 modulo n , then L(a, b) is not invertible modulo n. It follows that the owner of the private key can not decrypt the cipher C = (C1, C2) since he/she can not compute L(C1,C2) L(a,b) . In this short note, in order to decrypt the ciphertext C = (C1, C2), another map L similar to that given in [4] is constructed. More precisely, if L(a, b) is not invertible modulo n, we describe a method how to choose (a, b) such that L(a, b) is invertible modulo n and how to compute L(C1, C2).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notes on two methods for direct construction of probabilistic LFSR sequences of third order

1. The owner of the private key does not know the value of m such that C1 = sm(a, b) and C2 = s −m(a, b), and thus he/she can not compute L(C1, C2). 2. If sλ(a, b) = 3 modulo n , then L(a, b) is not invertible modulo n. It follows that the owner of the private key can not decrypt the cipher C = (C1, C2) since he/she can not compute L(C1,C2) L(a,b) . In this short note, in order to decrypt the c...

متن کامل

A Public-Key Cryptosystem Based on Lucas Sequences

Based on Lucas functions, an improved version of Diffie-hellman key distribution, El Gamal public key crypto-system scheme and El Gamal signature scheme are proposed, together with an implementation and computational cost. The security relies on the difficulty of factoring an RSA integer and on the difficulty of computing the discrete logarithm. Introduction In [1], Diffie and Hellman introduce...

متن کامل

Computation of an Integral Basis of Quartic Number Fields

In this paper, based on techniques of Newton polygons, a result which allows the computation of a p integral basis of every quartic number field is given. For each prime integer p, this result allows to compute a p-integral basis of a quartic number field K defined by an irreducible polynomial P (X) = X4 + aX + b ∈ Z[X] in methodical and complete generality.

متن کامل

Phylogenetic Analysis of Aedes aegypti Based on Mitochondrial ND4 Gene Sequences in Almadinah, Saudi Arabia

Background: Aedes aegypti is the main vector of the yellow fever and dengue virus. This mosquito has become the major indirect cause of morbidity and mortality of the human worldwide. Dengue virus activity has been reported recently in the western areas of Saudi Arabia. There is no vaccine for dengue virus until now, and the control of the disease depends on the control of the vector. Objectiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009